GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data
نویسندگان
چکیده
Cluster analysis has been applied to several domains with numerous applications. In this paper, we propose several GRASP with path-relinking heuristics for data clustering problems using as case study biological datasets. All these variants are based on the construction and local search procedures introduced by Nascimento et. al [22]. We hybridized the GRASP proposed by Nascimento et. al [22] with four alternatives for relinking method: forward, backward, mixed, and randomized. To our knowledge, GRASP with path-relinking has never been applied to cluster biological datasets. Extensive comparative experiments with other algorithms on a large set of test instances, according to different distance metrics (Euclidean, city block, cosine, and Pearson), show that the best of the proposed variants is both effective and efficient.
منابع مشابه
A hybrid data mining GRASP with path-relinking
The exploration of hybrid metaheuristics — combination of metaheuristics with concepts and processes from other research areas — has been an important trend in combinatorial optimization research. In this work, we developed a hybrid version of the GRASP metaheuristic which incorporates the path-relinking procedure — a memory-based intensification strategy — and a data mining module. Computation...
متن کاملGrasp with Path-relinking: Recent Advances and Applications
Path-relinking is a major enhancement to the basic greedy randomized adaptive search procedure (GRASP), leading to significant improvements in solution time and quality. Path-relinking adds a memory mechanism to GRASP by providing an intensification strategy that explores trajectories connecting GRASP solutions and the best elite solutions previously produced during the search. This paper revie...
متن کاملGrasp with Evolutionary Path-relinking
We propose GRASP with evolutionary path-relinking, a metaheuristic resulting from the hybridization of GRASP, path-relinking, and evolutionary path-relinking. This metaheuristic is applied to a network migration problem. Experiments show that a GRASP with evolutionary path-relinking heuristic finds solutions faster than a heuristic based on GRASP with path-relinking as well as one based on pure...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملGrasp with Path Relinking for the Three-index Assignment Problem
Abstract. This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3). GRASP is a multi-start metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explor...
متن کامل